On Plücker coordinates of a perfectly oriented planar network

نویسنده

  • Kelli Talaska
چکیده

Let G be a perfectly oriented planar graph. Postnikov’s boundary measurement construction provides a rational map from the set of positive weight functions on the edges of G onto the appropriate totally nonnegative Grassmann cell. We establish an explicit combinatorial formula for Postnikov’s map by expressing each Plücker coordinate of the image as a ratio of two polynomials in the edge weights, with positive integer coefficients. These polynomials are weight generating functions for certain subsets of edges in G.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Formula for Plücker Coordinates of a Perfectly Oriented Network

For a planar directed graph G, Postnikov’s boundary measurement map sends positive weight functions on the edges of G onto the appropriate totally nonnegative Grassmann cell. Assuming, without much loss of generality, that G is perfectly oriented, we establish an explicit formula for Postnikov’s map by expressing each Plücker coordinate as a ratio of two combinatorially defined polynomials in t...

متن کامل

A Formula for Plücker Coordinates Associated with a Planar Network

For a planar directed graph G, Postnikov’s boundary measurement map sends positive weight functions on the edges of G onto the appropriate totally nonnegative Grassmann cell. We establish an explicit formula for Postnikov’s map by expressing each Plücker coordinate as a ratio of two combinatorially defined polynomials in the edge weights, with positive integer coefficients. In the nonplanar set...

متن کامل

Quantum- and Quasi-Plücker Coordinates

We demonstrate a passage from the “quasi-Plücker coordinates” of Gelfand and Retakh, to the quantum Plücker coordinates built from qgeneric matrices. In the process, we rediscover the defining relations of the quantum Grassmannian of Taft and Towber and provide that algebra with more concrete geometric origins.

متن کامل

Forward kinematic analysis of planar parallel robots using a neural network-based approach optimized by machine learning

The forward kinematic problem of parallel robots is always considered as a challenge in the field of parallel robots due to the obtained nonlinear system of equations. In this paper, the forward kinematic problem of planar parallel robots in their workspace is investigated using a neural network based approach. In order to increase the accuracy of this method, the workspace of the parallel robo...

متن کامل

Using a Neural Network instead of IKM in 2R Planar Robot to follow rectangular path

Abstract— An educational platform is presented here for the beginner students in the Simulation and Artificial Intelligence sciences. It provides with a start point of building and simulation of the manipulators, especially of 2R planar Robot. It also displays a method to replace the inverse kinematic model (IKM) of the Robot with a simpler one, by using a Multi-Layer Perceptron Neural Network ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008